The Lucas-Pratt primality tree
نویسندگان
چکیده
منابع مشابه
The Lucas-Pratt primality tree
In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained through the prime factorization of p − 1 and a primitive root for p. V. Pratt’s proof that PRIMES is in NP, done via Lucas’s theorem, showed that a certificate of primality for a prime p could be obtained in O(log p) modular multiplications with integers at most p. We show that for all constants C ∈ R, the ...
متن کاملThe delegated Lucas tree
We analyze the effects of the observed increased share of delegated capital for trading strategies and equilibrium prices. We introduce delegation into a standard Lucas exchange economy, where in equilibrium some investors trade on their own account, but others decide to delegate trading to professional fund managers. Flow-performance incentive functions describe how much capital clients provid...
متن کاملA Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers
After defining a class of generalized Fibonacci numbers and Lucas numbers, we characterize the Fibonacci pseudoprimes of the mth kind. In virtue of the apparent paucity of the composite numbers which are Fibonacci pseudoprimes of the mth kind for distinct values o f the integral parameter m , a method, which we believe to be new, for finding large probable primes is proposed. An efficient compu...
متن کاملA Lucas Triangle Primality Criterion Dual to That of Mann-shanks
subject to the initial conditions A(l, 0) = 1, A(l, 1) ='2, with 4(n, /c) = 0 for & < 0 or k > n. This array has been called a Lucas triangle by Feinberg [1], because rising diagonals sum to give the Lucas numbers 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, ..., in contrast to the rising diagonals in the standard Pascal triangle where rising diagonals sum to give the Fibonacci numbers 1, 1, ...
متن کاملDistributed Primality Proving and the Primality of (23539+1)/3
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certiication of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2 3539 +1)=3, the rst ordinary Titanic prime.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2008
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-07-02002-9